Discrete Fixed Points: Models, Complexities, and Applications
نویسندگان
چکیده
منابع مشابه
Computational Models and Complexities of Tarski’s Fixed Points∗
We consider two models of computation for Tarski’s order preserving function f related to fixed points in a complete lattice: the oracle function model and the polynomial function model. We develop a complete understanding under the oracle function model for finding a Tarski’s fixed point as well as determining the uniqueness of Tarski’s fixed point in both the lexicographic ordering and the co...
متن کاملCoupled fixed points of generalized Kanann contraction and its applications
The purpose of this paper is to find of the theoretical results of fixed point theorems for a mixed monotone mapping in a metric space endowed with partially order by using the generalized Kanann type contractivity of assumption. Also, as an application, we prove the existence and uniqueness of solution for a first-order ordinary differential equation with periodic bou...
متن کاملFixed Points in Discrete Models for Regulatory Genetic Networks
It is desirable to have efficient mathematical methods to extract information about regulatory iterations between genes from repeated measurements of gene transcript concentrations. One piece of information is of interest when the dynamics reaches a steady state. In this paper we develop tools that enable the detection of steady states that are modeled by fixed points in discrete finite dynamic...
متن کاملFixed Points for Discrete Logarithms
Abstract: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p− 1] with logr t = t. Here, logr is the discrete logarithm function to the base r for the cyclic group (Z/pZ)×. Tools include a numerically explicit version of the Pólya–Vinogradov inequality for the sum of values of a Dirichlet character on an interval, s...
متن کاملStability of Vertex Fixed Points and Applications
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the differential of the mapping which defines the transition from one generation to the next. Based on a simple formula for this spectrum, fully nondeceptive functions having exponentially many non-optimal fixed points are constructed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2011
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1110.0511